Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
نویسندگان
چکیده
منابع مشابه
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
In this paper we introduce and analyze new classes of cooperative games related to facility location models. The players are the customers (demand points) in the location problem and the characteristic value of a coalition is the cost of serving its members. Specifically, the cost in our games is the service diameter of the coalition. We study the existence of core allocations for these games, ...
متن کاملOn the Minimum Diameter Spanning Tree Problem
We point out a relation between the minimum diameter spanning tree of a graph and its absolute 1-center. We use this relation to solve the diameter problem and an extension of it eeciently.
متن کاملOn the Minimum Labelling Spanning bi-Connected Subgraph problem
We introduce the minimum labelling spanning bi-connected subgraph problem (MLSBP) replacing connectivity by bi-connectivity in the well known minimum labelling spanning tree problem (MLSTP). A graph is bi-connected if, for every two vertices, there are, at least, two vertex-disjoint paths joining them. The problem consists in finding the spanning bi-connected subgraph or block with minimum set ...
متن کاملGeometric Minimum Diameter Spanning Tree Problem
Given a set P of n points in a plane, the Geometric Minimum Diameter Spanning Tree (GMDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. The best known algorithm for this problem runs in slightly sub-cubic time. In this report, I have surveyed some algorithms and approximation schemes developed for this problem and investigated the relation between this pro...
متن کاملFacility Location and the Geometric Minimum-Diameter Spanning Tree
Let P be a set of n points in the plane. The geometric minimum-diameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a monoor a dipolar MDST, i.e. a MDST with one or two nodes of degree greater 1, respectively. The more difficult dipolar case can so far only be solved in slightly subcubic time. This pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.07.020